Duration Calculus of Weakly Monotonic Time
نویسندگان
چکیده
We extend Duration Calculus to a logic which allows description of Discrete Processes where several steps of computation can occur at the same time point. The resulting logic is called Duration Calculus of Weakly Monotonic Time (WDC). It allows effects such as true synchrony and digitisation to be modelled. As an example of this, we formulate a novel semantics of Timed CSP assuming that the communication and computation take no time.
منابع مشابه
Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus
Deductive methods for the verification of hybrid systems vary on the format of statements in correctness proofs. Building on the example of Hoare triple-based reasoning, we have investigated several such methods for systems described in Hybrid CSP, each based on a different assertion language, notation for time, and notation for proofs, and each having its pros and cons with respect to expressi...
متن کاملSafe Runtime Verification of Real-Time Properties
Introducing a monitor on a system typically changes the system’s behaviour by slowing the system down and increasing memory consumption. This may possibly result in creating new bugs, or possibly even ‘fixing’ bugs, only to reappear as the monitor is removed. Properties written in a real-time logic, such as duration calculus, can be particularly sensitive to such changes induced through monitor...
متن کاملL. Descalço on the Injectivity of the Leibniz Operator
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that “monotonicity” cannot be discarded on this definition, by presenting an example of a system with injective and non monotonic Leibniz operator. We also show that the non injectivity of the non protoalgebraic inf-sup fragment of the Classic Propositional Calculus...
متن کاملOn Verification of Linear Occurrence Properties of Real-Time Systems
Duration Calculus of Weakly Monotonic Time (WDC) is an extension of DC to allow description of discrete processes where several steps of computation can occur at the same time point. In this paper, we introduce Linear Occurrence Invariants (LOI) which is a subclass of WDC formulas and give an algorithm to check real-time automata for LOI using integer programming. LOI can be used effectively to...
متن کاملPart I: Methods Optimization under Composite Monotonic Constraints and Constrained Optimization over the Efficient Set
We present a unified approach to a class of nonconvex global optimization problems with composite monotonic constraints. (By composite monotonic function is meant a function which is the composition of a monotonic function on R n with a mapping from R n → R m with m ≤ n.) This class includes problems with constraints involving products of linear functions, sums of ratio functions, etc., and als...
متن کامل